A Geometric Approach to Color Image Regularization
نویسندگان
چکیده
We present a new vectorial total variation method that addresses the problem of color consistent image filtering. Our approach is inspired from the double-opponent cell representation in the human visual cortex. Existing methods of vectorial total variation regularizers have insufficient (or no) coupling between the color channels and thus may introduce color artifacts. We address this problem by introducing a novel coupling between the color channels related to a pullbackmetric from the opponent space to the data (RGB color) space. Our energy is a non-convex, non-smooth higher-order vectorial total variation approach and promotes color consistent image filtering via a coupling term. For a convex variant, we show well-posedness and existence of a solution in the space of vectorial bounded variation. For the higher-order scheme we employ a half-quadratic strategy, which model the non-convex energy terms as the infimum of a sequence of quadratic functions. In experiments, we elaborate on traditional image restoration applications of inpainting, deblurring and denoising. Regarding the latter, we demonstrate state of the art restoration quality with respect to structure coherence and color consistency.
منابع مشابه
Robust Fuzzy Content Based Regularization Technique in Super Resolution Imaging
Super-resolution (SR) aims to overcome the ill-posed conditions of image acquisition. SR facilitates scene recognition from low-resolution image(s). Generally assumes that high and low resolution images share similar intrinsic geometries. Various approaches have tried to aggregate the informative details of multiple low-resolution images into a high-resolution one. In this paper, we present a n...
متن کاملWasserstein Regularization of Imaging Problems
This paper introduces a novel and generic framework embedding statistical constraints for variational problems. We resort to the theory of Monge-Kantorovich optimal mass transport to define penalty terms depending on statistics from images. To cope with the computation time issue of the corresponding Wasserstein distances involved in this approach, we propose an approximate variational formulat...
متن کاملPolyakov Action Minimization for Efficient Color Image Processing
The Laplace-Beltrami operator is an extension of the Laplacian from flat domains to curved manifolds. It was proven to be useful for color image processing as it models a meaningful coupling between the color channels. This coupling is naturally expressed in the Beltrami framework in which a color image is regarded as a two dimensional manifold embedded in a hybrid, five-dimensional, spatial-ch...
متن کاملPolyakov Action for Efficient Color Image Processing∗
The Laplace-Beltrami operator is an extension of the Laplacian from flat domains to curved manifolds. It was proven to be useful for color image processing as it models a meaningful coupling between the color channels. This coupling is naturally expressed in the Beltrami framework in which a color image is regarded as a two dimensional manifold embedded in a hybrid, five dimensional, spatial-ch...
متن کاملKernel Cuts: MRF meets Kernel&Spectral Clustering
The log-likelihood energy term in popular model-fitting segmentation methods, e.g. [64, 14, 50, 20], is presented as a generalized “probabilistic” K-means energy [33] for color space clustering. This interpretation reveals some limitations, e.g. over-fitting. We propose an alternative approach to color clustering using kernel K-means energy with well-known properties such as non-linear separati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1605.05977 شماره
صفحات -
تاریخ انتشار 2016